Extending the QCR method to general mixed-integer programs
نویسندگان
چکیده
Let (MQP ) be a general mixed integer quadratic program that consists of minimizing a quadratic function subject to linear constraints. In this paper, we present a convex reformulation of (MQP ), i.e. we reformulate (MQP ) into an equivalent program, with a convex objective function. Such a reformulation can be solved by a standard solver that uses a branch and bound algorithm. We prove that our reformulation is the best one within a convex reformulation scheme, from the continuous relaxation point of view. This reformulation, that we call MIQCR (Mixed Integer Quadratic Convex Reformulation), is based on the solution of an SDP relaxation of (MQP ). Computational experiences are carried out with instances of (MQP ) including one equality constraint or one inequality constraint. The results show that most of the considered instances with up to 40 variables can be solved in one hour of CPU time by a standard solver.
منابع مشابه
Quadratic Convex Reformulation : a Computational Study of the Graph Bisection Problem
Given an undirected graph G = (V,E), we consider the graph bisection problem, which consists in partitioning the nodes of G in two disjoined sets with p and n− p nodes respectively such that the total weight of edges crossing between subsets is minimal. We apply QCR to it, a general method, presented in [4], which combines semidefinite programming (SDP) and Mixed Integer Quadratic Programming (...
متن کاملA Penalized Quadratic Convex Reformulation Method for Random Quadratic Unconstrained Binary Optimization
The Quadratic Convex Reformulation (QCR) method is used to solve quadratic unconstrained binary optimization problems. In this method, the semidefinite relaxation is used to reformulate it to a convex binary quadratic program which is solved using mixed integer quadratic programming solvers. We extend this method to random quadratic unconstrained binary optimization problems. We develop a Penal...
متن کاملUsing quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints
Quadratic Convex Reformulation (QCR) is a technique that has been proposed for binary and mixed integer quadratic programs. In this paper, we extend the QCR method to convex quadratic programs with linear complementarity constraints (QPCCs). Due to the complementarity relationship between the nonnegative variables y and w, a term yDw can be added to the QPCC objective function, where D is a non...
متن کاملAFRL-OSR-VA-TR-2014-0126 Global Resolution of Convex Programs with Complementarity Constraints
Quadratic Convex Reformulation (QCR) is a technique that has been proposed for binary and mixed integer quadratic programs. In this paper, we extend the QCR method to convex quadratic programs with linear complementarity constraints (QPCCs). Due to the complementarity relationship between the nonnegative variables y and w, a term yDw can be added to the QPCC objective function, where D is a non...
متن کاملReformulating Mixed-Integer Quadratically Constrained Quadratic Programs
It is well known that semidefinite programming (SDP) can be used to derive useful relaxations for a variety of optimisation problems. Moreover, in the particular case of mixed-integer quadratic programs, SDP has been used to reformulate problems, rather than merely relax them. The purpose of reformulation is to strengthen the continuous relaxation of the problem, while leaving the optimal solut...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Program.
دوره 131 شماره
صفحات -
تاریخ انتشار 2012